A Submodular Function Minimization Algorithm Based on the Minimum-Norm Base∗
نویسنده
چکیده
We consider an application of the minimum-norm-point algorithm to submodular function minimization. Although combinatorial polynomial algorithms for submodular function minimization (SFM) have recently been obtained, there still remain (open) problems of reducing the complexity of the SFM algorithms and of constructing a practically fast SFM algorithms. We show some possible approach to the problems by means of the minimum-norm-point algorithm. Computational results on submodular function minimization reveal that our algorithm outperforms existing polynomial algorithms for SFM.
منابع مشابه
Provable Submodular Minimization via Fujishige-Wolfe’s Algorithm∗
Owing to several applications in large scale learning and vision problems, fast submodular function minimization (SFM) has become a critical problem. Theoretically, unconstrained SFM can be performed in polynomial time [10, 11]. However, these algorithms are typically not practical. In 1976, Wolfe [22] proposed an algorithm to find the minimum Euclidean norm point in a polytope, and in 1980, Fu...
متن کاملProvable Submodular Minimization using Wolfe's Algorithm
Owing to several applications in large scale learning and vision problems, fast submodular function minimization (SFM) has become a critical problem. Theoretically, unconstrained SFM can be performed in polynomial time [10, 11]. However, these algorithms are typically not practical. In 1976, Wolfe [21] proposed an algorithm to find the minimum Euclidean norm point in a polytope, and in 1980, Fu...
متن کاملA note on the Minimum Norm Point algorithm
We present a provably more efficient implementation of the Minimum Norm Point Algorithm conceived by Fujishige than the one presented in [FUJI06]. The algorithm solves the minimization problem for a class of functions known as submodular. Many important functions, such as minimum cut in the graph, have the so called submodular property [FUJI82]. It is known that the problem can also be efficien...
متن کاملOn fast approximate submodular minimization: Extended Version
We are motivated by an application to extract a representative subset of machine learning training data and by the poor empirical performance we observe of the popular minimum norm algorithm. In fact, for our application, minimum norm can have a running time of about O(n) (O(n) oracle calls). We therefore propose a fast approximate method to minimize arbitrary submodular functions. For a large ...
متن کاملOn fast approximate submodular minimization
We are motivated by an application to extract a representative subset of machine learning training data and by the poor empirical performance we observe of the popular minimum norm algorithm. In fact, for our application, minimum norm can have a running time of about O(n) (O(n) oracle calls). We therefore propose a fast approximate method to minimize arbitrary submodular functions. For a large ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009